一类弱奇性Volterra积分微分方程的级数展开数值解法

本文考察了一类弱奇性积分微分方程的级数展开数值解法,并给出了相应的收敛性分析.理论分析结果表明,若用已知函数的谱配置多项式逼近已知函数,那么方程的数值解以谱精度逼近方程的真解.数值实验数据也验证了这一理论分析结果.     

带有不确定参数的一类混沌金融系统的广义投影同步

针对带有不确定参数的一类混沌金融系统,提出了实现驱动系统和响应系统广义投影同步的自适应控制策略,并基于Lyapunov稳定性理论给出和验证了广义投影同步稳定性判据.数值仿真验证了控制策略和理论分析的有效性.     

旋转流动的低模分析及仿真研究

为了探讨Couette-Taylor流从层流到湍流过渡的方式以及流动发展到湍流之后混沌吸引子的某些特征等问题,采用低模分析方法研究了Couette-Taylor流的部分动力学行为及仿真问题,讨论了Couette-Taylor流三模态类Lorenz型方程组的动力学行为,包括定态的失稳、极限环的出现、分岔与混沌的演变和全局稳定性分析等。通过线性稳定性分析和数值模拟等方法给出了此三维模型分岔与混沌等动力学行为及其演化历程,并借此解释了Couette-Taylor流试验中观察到的部分涡流的演化过程.基于系统的分岔图、Lyapunov指数谱、功率谱、Poincaré(庞加莱)截面和返回映射等揭示了系统混沌行为的普适特征.     

基于改进的PSO-SVM的音频信号特征识别和分类

针对音频信号准确性分类的问题,提出一种基于改进的的粒子群优化算法(PSO)的支持向量机(SVM)音频信号分类的方法,简称IPSO-SVM.首先用Mel倒谱系数法对4种音频信号进行特征提取.其次在PSO中引入自适应变异因子,能够成功地跳出局部极小值点;然后对PSO中的惯性权重进行了改进,将惯性权重由常数变为指数型递减函数.随着迭代的进行,使权重逐渐减小,这样做有利于粒子进行局部寻优.最后用改进的PSO不断优化SVM中的惩罚因子c和核函数参数g来提高预测精度.实验结果表明,与传统的SVM、PSO-SVM、GA-SVM相比,我们提出的IPSO-SVM算法分类结果更精确.     

基于动态自适应t分布变异的人群搜索算法

针对人群搜索算法在进化后期大量个体聚集局部最优时,易陷入局部最优,搜索精度低的缺陷,提出一种基于t分布变异的人群搜索算法.算法使用动态自适应方式确定变异步长,引入t分布变异算子以融合柯西变异和高斯变异的优点,促进算法在进化早期具备良好的全局探索能力,在进化后期收获较强的局部开发能力,增加种群的多样性;采用边界缓冲墙策略处理越界问题,避免越界个体聚集在边界值上的缺陷.实验结果表明,算法比基本人群搜索算法具有更高的寻优精度和收敛速度,是一种有效的算法.     

股票市场的长记忆及其动态结构

本文提出了结合平均小波系数法和自回归原始自助法的稳健长记忆检验,蒙特卡罗模拟显示该方法对于短期记忆过程具有稳定性。基于该方法对2005年4月8日至2015年6月30日的中国、美国、香港和德国股市进行了实证分析。全局检验结果表明仅中国的股票市场存在显著的长记忆,并且风险因素无法对长记忆解释,而美国、德国和香港的股市不存在长记忆。基于递增窗口的动态Hurst指数分析显示,金融危机时期4个股市都存在显著的长记忆。2010年后,除中国股市外,其余三个股市几乎不存在长记忆现象。     

一类金融混沌系统的线性控制模型

针对一类金融混沌系统,建立存款利率线性控制模型、投资需求线性控制模型和综合线性控制模型,运用线性反馈控制的方法调整导致系统产生混沌的参数组合,实现对系统稳定性的有效控制.首先对控制模型进行动力学分析,从理论上分析控制模型的反馈系数的取值范围;然后通过数值模拟证明方法的可行性;最后讨论线性反馈控制对金融危机宏观调控的实际意义.     

Constructing near spanning trees with few local inspections

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded‐degree graph. Given an edge e in G we would like to decide whether e belongs to a connected subgraph consisting of edges (for a prespecified constant ), where the decision for different edges should be consistent with the same subgraph . Can this task be performed by inspecting only a constant number of edges in G ? Our main results are:

• We show that if every t‐vertex subgraph of G has expansion then one can (deterministically) construct a sparse spanning subgraph of G using few inspections. To this end we analyze a “local” version of a famous minimum‐weight spanning tree algorithm.
• We show that the above expansion requirement is sharp even when allowing randomization. To this end we construct a family of 3‐regular graphs of high girth, in which every t‐vertex subgraph has expansion . We prove that for this family of graphs, any local algorithm for the sparse spanning graph problem requires inspecting a number of edges which is proportional to the girth.

© 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 183–200, 2017     

Convergent sequences of sparse graphs: A large deviations approach

Models based on sparse graphs are of interest to many communities: they appear as basic models in combinatorics, probability theory, optimization, statistical physics, information theory, and more applied fields of social sciences and economics. Different notions of similarity (and hence convergence) of sparse graphs are of interest in different communities. In probability theory and combinatorics, the notion of Benjamini‐Schramm convergence, also known as left‐convergence, is used quite frequently. Statistical physicists are interested in the the existence of the thermodynamic limit of free energies, which leads naturally to the notion of right‐convergence. Combinatorial optimization problems naturally lead to so‐called partition convergence, which relates to the convergence of optimal values of a variety of constraint satisfaction problems. The relationship between these different notions of similarity and convergence is, however, poorly understood. In this paper we introduce a new notion of convergence of sparse graphs, which we call Large Deviations or LD‐convergence, and which is based on the theory of large deviations. The notion is introduced by “decorating” the nodes of the graph with random uniform i.i.d. weights and constructing corresponding random measures on and . A graph sequence is defined to be converging if the corresponding sequence of random measures satisfies the Large Deviations Principle with respect to the topology of weak convergence on bounded measures on . The corresponding large deviations rate function can be interpreted as the limit object of the sparse graph sequence. In particular, we can express the limiting free energies in terms of this limit object. We then establish that LD‐convergence implies the other three notions of convergence discussed above, and at the same time establish several previously unknown relationships between the other notions of convergence. In particular, we show that partition‐convergence does not imply left‐ or right‐convergence, and that right‐convergence does not imply partition‐convergence. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 51, 52–89, 2017